Initialized Jacobi Optimization in Independent Component Analysis
نویسندگان
چکیده
The authors propose a new solution to the minimization of marginal entropies (ME) in multidimensional independent component analysis (ICA). Starting from the ’Jacobi optimization’ (JO), we focus on a novel method based on initialization. In this method, we first compute the moment matrix for the prewhitened inputs. Then, the moments at each iteration of this Initialized Jacobi Optimization (IJO) are computed as rotations of this matrix. We include a computational comparison between the JO and IJO to design the Optimized Jacobi Optimization (OJO). This new method is available for a wide set of fourth order based contrasts. Experiments have been included to show that this algorithm have an excellent performance at a low computational cost and memory requirements in comparison to other well-known algorithms.
منابع مشابه
Adaptive Initialized Jacobi Optimization in Independent Component Analysis
In this paper, we focus on the fourth order cumulant based adaptive methods for independent component analysis. We propose a novel method based on the Jacobi Optimization, available for a wide set of minimum entropy (ME) based contrasts. In this algorithm we adaptively compute a moment matrix, an estimate of some fourth order moments of the whitened inputs. Starting from this matrix, the soluti...
متن کاملHigh-Order Constrasts for Independent Component Analysis
This article considers high-order measures of independence for the independent component analysis problem and discusses the class of Jacobi algorithms for their optimization. Several implementations are discussed. We compare the proposed approaches with gradient-based techniques from the algorithmic point of view and also on a set of biomedical data.
متن کاملOptimization on the Orthogonal Group for Independent Component Analysis
This paper derives a new algorithm that performs independent component analysis (ICA) by optimizing the contrast function of the RADICAL algorithm. The core idea of the proposed optimization method is to combine the global search of a good initial condition with a gradient-descent algorithm. This new ICA algorithm performs faster than the RADICAL algorithm (based on Jacobi rotations) while stil...
متن کاملPivot Selection Strategies in Jacobi Joint Block-Diagonalization
A common problem in independent component analysis after prewhitening is to optimize some contrast on the orthogonal or unitary group. A popular approach is to optimize the contrast only with respect to a single angle (Givens rotation) and to iterate this procedure. In this paper we discuss the choice of the sequence of rotations for such so-called Jacobi-based techniques, in the context of joi...
متن کاملOnline ICA: Understanding Global Dynamics of Nonconvex Optimization via Diffusion Processes
Solving statistical learning problems often involves nonconvex optimization. Despite the empirical success of nonconvex statistical optimization methods, their global dynamics, especially convergence to the desirable local minima, remain less well understood in theory. In this paper, we propose a new analytic paradigm based on diffusion processes to characterize the global dynamics of nonconvex...
متن کامل